Regular Embeddings of Multigraphs Hubert De Fraysseix and Patrice Ossona De Mendez
نویسنده
چکیده
We prove that the vertex set of any twin-free loopless multigraph G has an embedding into some point set P of some Euclidean space R , such that the automorphism group of G is isomorphic to the isometry group of R globally preserving P .
منابع مشابه
Regular embeddings of multigraphs
We prove that the vertex set of any twin-free loopless multigraph G has an embedding into some point set P of some Euclidean space R , such that the automorphism group of G is isomorphic to the isometry group of R globally preserving P .
متن کاملOn Cotree-Critical and DFS Cotree-Critical Graphs
We give a characterization of DFS cotree-critical graphs which is central to the linear time Kuratowski finding algorithm implemented in PIGALE (Public Implementation of a Graph Algorithm Library and Editor [2]) by the authors, and deduce a justification of a very simple algorithm for finding a Kuratowski subdivision in a DFS cotree-critical graph. Communicated by: P. Mutzel and M. Jünger; subm...
متن کاملPlanarity and Edge Poset Dimension
Dif ferent areas of discrete mathematics lead to instrinsically dif ferent characterizations of planar graphs . Planarity is expressed in terms of topology , combinatorics , algebra or search trees . More recently , Schnyder’s work has related planarity to partial order theory . Acyclic orientations and associated edge partial orders lead to a new characterization of planar graphs , which also ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006